Lebesgue’s Covering Lemma, Uniform Continuity and Segmentation of Arcs
نویسندگان
چکیده
For mappings from a metric space to a metric space, a notion of uniform continuity is defined. If we introduce natural topologies to the metric spaces, a uniformly continuous function becomes continuous. On the other hand, if the domain is compact, a continuous function is uniformly continuous. For this proof, Lebesgue’s covering lemma is also proved. An arc, which is homeomorphic to [0,1], can be divided into small segments, as small as one wishes.
منابع مشابه
The MATH 245A analysis course is by and large devoted to Lebesgue’s theory of measure and integration. This theory stands on the foundations laid over 200 years by many great minds
The MATH 245A analysis course is by and large devoted to Lebesgue’s theory of measure and integration. This theory stands on the foundations laid over 200 years by many great minds working in mathematics. In order to appreciate these better, we begin by a brief recount of the history of integral and the rather winding road that led to Lebesgue’s ultimate formulation. In what follows, I will fre...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملLebesgue's dominated convergence theorem in Bishop's style
We present a constructive proof in Bishop’s style of Lebesgue’s dominated convergence theorem in the abstract setting of ordered uniform spaces. The proof generalises to this setting a classical proof in the framework of uniform lattices presented by Hans Weber in “Uniform Lattices II: Order Continuity and Exhaustivity”, in Annali di Matematica Pura ed Applicata (IV), Vol. CLXV (1993). 1. Both ...
متن کاملThe topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
متن کاملCourse 421: Algebraic Topology Section 1: Topological Spaces
1 Topological Spaces 1 1.1 Continuity and Topological Spaces . . . . . . . . . . . . . . . 1 1.2 Topological Spaces . . . . . . . . . . . . . . . . . . . . . . . . 1 1.3 Metric Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.4 Further Examples of Topological Spaces . . . . . . . . . . . . 3 1.5 Closed Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.6 Hausdorff ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004